An accurate algorithm for evaluating rational functions
نویسندگان
چکیده
منابع مشابه
An Approach for Accurate Edging using Dynamic Membership Functions
In this paper, by means of fuzzy approaches, an accurate method is introduced for edging of color photographs. The difference between our method with other similar methods is the use of a morphological operation to think or thick the obtained edges. In this proposed method, a 3×3 window is dragged on the photo. For each block, 12 point sets will be defined, each including two non-overlapping po...
متن کاملAn Algorithm for Deciding the Summability of Bivariate Rational Functions
Let ∆xf(x, y) = f(x + 1, y) − f(x, y) and ∆yf(x, y) = f(x, y + 1) − f(x, y) be the difference operators with respect to x and y. A rational function f(x, y) is called summable if there exist rational functions g(x, y) and h(x, y) such that f(x, y) = ∆xg(x, y)+ ∆yh(x, y). Recently, Chen and Singer presented a method for deciding whether a rational function is summable. To implement their method ...
متن کاملan approach for accurate edging using dynamic membership functions
in this paper, by means of fuzzy approaches, an accurate method is introduced for edging of color photographs. the difference between our method with other similar methods is the use of a morphological operation to think or thick the obtained edges. in this proposed method, a 3×3 window is dragged on the photo. for each block, 12 point sets will be defined, each including two non-overlapping po...
متن کاملFast and Accurate Con-Eigenvalue Algorithm for Optimal Rational Approximations
Abstra t. The need to ompute small on-eigenvalues and the asso iated on-eigenve tors of positive-de nite Cau hy matri es naturally arises when onstru ting rational approximations with a (near) optimally small L error. Spe i ally, given a rational fun tion with n poles in the unit disk, a rational approximation with m ≪ n poles in the unit disk may be obtained from the mth on-eigenve tor of an n...
متن کاملA recombination algorithm for the decomposition of multivariate rational functions
In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombination strategy is the used of Darboux polynomials. We study the complexity of this strategy and we show that this method improves the previous ones. In appendix, we explain how the strategy proposed recently by J. Berth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2018
ISSN: 0096-3003
DOI: 10.1016/j.amc.2018.05.039